CONTROL AND ESTIMATION ALGORITHMS FOR MULTIPLE-AGENT SYSTEMS

Tese arquivada ao abrigo da Portaria nº 227/2017 de 25 de julhoIn this thesis we study crucial problems within complex, large scale, networked control systems and mobile sensor networks. The ¯rst one is the problem of decomposition of a large-scale system into several interconnected subsystems, based on the imposed information structure constraints. After associating an intelligent agent with each subsystem, we face with a problem of formulating their local estimation and control laws and designing inter-agent communication strategies which ensure stability, desired performance, scalability and robustness of the overall system. Another problem addressed in this thesis, which is critical in mobile sensor networks paradigm, is the problem of searching positions for mobile nodes in order to achieve optimal overall sensing capabilities. Novel, overlapping decentralized state and parameter estimation schemes based on the consensus strategy have been proposed, in both continuous-time and discrete-time. The algorithms are proposed in the form of a multi-agent network based on a combination of local estimators and a dynamic consensus strategy, assuming possible intermittent observations and communication faults. Under general conditions concerning the agent resources and the network topology, conditions are derived for the stability and convergence of the algorithms. For the state estimation schemes, a strategy based on minimization of the steady-state mean-square estimation error is proposed for selection of the consensus gains; these gains can also be adjusted by local adaptation schemes. It is also demonstrated that there exists a connection between the network complexity and e±ciency of denoising, i.e., of suppression of the measurement noise in°uence. Several numerical examples serve to illustrate characteristic properties of the proposed algorithm and to demonstrate its applicability to real problems. Furthermore, several structures and algorithms for multi-agent control based on a dynamic consensus strategy have been proposed. Two novel classes of structured, overlapping decentralized control algorithms are presented. For the ¯rst class, an agreement between the agents is implemented at the level of control inputs, while the second class is based on the agreement at the state estimation level. The proposed control algorithms have been illustrated by several examples. Also, the second class of the proposed consensus based control scheme has been applied to decentralized overlapping tracking control of planar formations of UAVs. A comparison is given with the proposed novel design methodology based on the expansion/contraction paradigm and the inclusion principle. Motivated by the applications to the optimal mobile sensor positioning within mobile sensor networks, the perturbation-based extremum seeking algorithm has been modifed and extended. It has been assumed that the integrator gain and the perturbation amplitude are time varying (decreasing in time with a proper rate) and that the output is corrupted with measurement noise. The proposed basic, one dimensional, algorithm has been extended to two dimensional, hybrid schemes and directly applied to the planar optimal mobile sensor positioning, where the vehicles can be modeled as velocity actuated point masses, force actuated point masses, or nonholonomic unicycles. The convergence of all the proposed algorithms, with probability one and in the mean square sense, has been proved. Also, the problem of target assignment in multi-agent systems using multi-variable extremum seeking algorithm has been addressed. An algorithm which e®ectively solves the problem has been proposed, based on the local extremum seeking of the specially designed global utility functions which capture the dependance among di®erent, possibly con°icting objectives of the agents. It has been demonstrated how the utility function parameters and agents' initial conditions impact the trajectories and destinations of the agents. All the proposed extremum seeking based algorithms have been illustrated with several simulations

Fourier Analysis of Signals on Directed Acyclic Graphs (DAG) Using Graph Zero-Padding

Directed acyclic graphs (DAGs) are used for modeling causal relationships, dependencies, and flows in various systems. However, spectral analysis becomes impractical in this setting because the eigen-decomposition of the adjacency matrix yields all eigenvalues equal to zero. This inherent property of DAGs results in an inability to differentiate between frequency components of signals on such graphs. This problem can be addressed by alternating the Fourier basis or adding edges in a DAG. However, these approaches change the physics of the considered problem. To address this limitation, we propose a graph zero-padding approach. This approach involves augmenting the original DAG with additional vertices that are connected to the existing structure. The added vertices are characterized by signal values set to zero. The proposed technique enables the spectral evaluation of system outputs on DAGs (in almost all cases), that is the computation of vertex-domain convolution without the adverse effects of aliasing due to changes in a graph structure, with the ultimate goal of preserving the output of the system on a graph as if the changes in the graph structure were not done.Comment: 10 pages, 12 figure